Subspace Identification Method for Combined Deterministic-stochastic Bilinear Systems
نویسندگان
چکیده
In this paper, a ‘four-block’ subspace system identification method for combined deterministic-stochastic bilinear systems is developed. Estimation of state sequences, followed by estimation of system matrices, is the central component of subspace identification methods. The prominent difference of our new approach is a ‘four-block’ arrangement of data matrices which leads to a linearization of the system state equation, when written in block form. A major advantage of this approach, over a previous bilinear subspace algorithm, is that the measured input is not restricted to be white. We show that, providing a certain data-dependent eigenvalue condition is met, our algorithm provides asymptotically unbiased estimates, and we indicate the rate at which the bias decreases. Simulation results show that this algorithm requires a smaller sample size than earlier algorithms (for comparable performance) and that the computational complexity is significantly lower. Copyright c ©2000 IFAC
منابع مشابه
A New Subspace Identification Method for Bilinear Systems
In this paper, asymptotically unbiased subspace algorithms for the identification of bilinear systems are developed. Two three-block subspace algorithms are developed for the deterministic system case and two four-block ones for the combined deterministic-stochastic case. The input signal to the system does not have to be white, which is a major advantage over an existing subspace method for bi...
متن کاملSubspace Identification of Closed Loop Systems by Stochastic Realization
We develop a closed loop subspace identification method based on stochastic realization theory. Using the preliminary orthogonal decomposition of (Picci and Katayama, 1996b) we show that, under the assumption that the exogenous input is feedback-free and persistently exciting (PE), the identification of closed loop systems is divided into two subproblems: the deterministic identification of the...
متن کاملCriteria for informative experiments with subspace identification
Informative experiments are identification experiments which contain sufficient information for an identification algorithm to discriminate between different models in an intended model set. In this paper, a particular set of identification algorithms, namely subspace based identification, is considered. Criteria for experiments to be informative with these methods in the deterministic setup an...
متن کاملA New Subspace Identification Method for Closed-Loop Systems Using Measurable Disturbance
In this paper, we consider a closed-loop subspace identification problem without using probing inputs; but we assume that there is a measurable disturbance which can be used as a test input for identification. Deterministic and stochastic subsystems are derived by applying the orthogonal decomposition (ORT) of the joint input-output process and realization methods. We develop a new ORTbased clo...
متن کاملA unifying theorem for three subspace system identification algorithms
The aim of this paper is to indicate and explore the similarities between three different subspace algorithms for the identification of combined deterministic-stochastic systems. The similarities between these algorithms have been obscured, due to different notations and backgrounds. It is shown that all three algorithms are special cases of one unifying theorem. The comparison also reveals tha...
متن کامل